State assignments for reducing the number of delay elements in sequential machines
نویسندگان
چکیده
منابع مشابه
Generation of Internal State Assignments for Large Asynchronous Sequential Machines
Several algorithms have been proposed for generating satisfactory state assignments for normal fundamental mode asynchronous sequential circuits. Programmed versions of minimal and near-minimal techniques have been incorporated in automated synthesis systems, but are known to require computational efforts which increase exponentially with flow table size. Other methods, requiring much less effo...
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
the test for adverse selection in life insurance market: the case of mellat insurance company
انتخاب نامساعد یکی از مشکلات اساسی در صنعت بیمه است. که ابتدا در سال 1960، توسط روتشیلد واستیگلیتز مورد بحث ومطالعه قرار گرفت ازآن موقع تاکنون بسیاری از پژوهشگران مدل های مختلفی را برای تجزیه و تحلیل تقاضا برای صنعت بیمه عمر که تماما ناشی از عدم قطعیت در این صنعت میباشد انجام داده اند .وهدف از آن پیدا کردن شرایطی است که تحت آن شرایط انتخاب یا کنار گذاشتن یک بیمه گزار به نفع و یا زیان شرکت بیمه ...
15 صفحه اولTest Generation for Sequential Nets of Abstract State Machines
Test generation techniques based on model checking suffer from the state space explosion problem. However, for a family of systems that can be easily decomposed in sub-systems, we devise a technique to cope with this problem. To model such systems, we introduce the notion of sequential net of Abstract State Machines (ASMs), which represents a system constituted by a set of ASMs such that only o...
متن کاملDecomposition of Finite State Machines for Area, Delay Minimization
In this paper, we consider the state assignment problem as that of the decomposition of finite state machines and transform this decomposition problem into an orthogonal partitioning problem with a certain cost function. We attempt to justify this cost function in two ways, first by using an idealized model of multi-level logic implementation, and second by empirical studies of a particular ben...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1967
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(67)90296-3